A GPU-based hyperbolic SVD algorithm
نویسندگان
چکیده
A one-sided Jacobi hyperbolic singular value decomposition (HSVD) algorithm, using a massively parallel graphics processing unit (GPU), is developed. The algorithm also serves as the final stage of solving a symmetric indefinite eigenvalue problem. Numerical testing demonstrates the gains in speed and accuracy over sequential and MPI-parallelized variants of similar Jacobi-type HSVD algorithms. Finally, possibilities of hybrid CPU–GPU parallelism are discussed.
منابع مشابه
GPU Accelerated Randomized Singular Value Decomposition and Its Application in Image Compression
In this paper, we present a GPU-accelerated implementation of randomized Singular Value Decomposition (SVD) algorithm on a large matrix to rapidly approximate the top-k dominating singular values and correspondent singular vectors. The fundamental idea of randomized SVD is to condense a large matrix into a small dense matrix by random sampling while keeping the important information. Then perfo...
متن کاملA GPU-Based Approximate SVD Algorithm
Approximation of matrices using the Singular Value Decomposition (SVD) plays a central role in many science and engineering applications. However, the computation cost of an exact SVD is prohibitively high for very large matrices. In this paper, we describe a GPU-based approximate SVD algorithm for large matrices. Our method is based on the QUIC-SVD introduced by [6], which exploits a tree-base...
متن کاملResearch on Color Watermarking Algorithm Based on RDWT-SVD
In this paper, a color image watermarking algorithm based on Redundant Discrete Wavelet Transform (RDWT) and Singular Value Decomposition (SVD) is proposed. The new algorithm selects blue component of a color image to carry the watermark information since the Human Visual System (HVS) is least sensitive to it. To increase the robustness especially towards affine attacks, RDWT is adopted for its...
متن کاملHigh-Performance Out-of-core Block Randomized Singular Value Decomposition on GPU
Fast computation of singular value decomposition (SVD) is of great interest in various machine learning tasks. Recently, SVD methods based on randomized linear algebra have shown significant speedup in this regime. This paper attempts to further accelerate the computation by harnessing a modern computing architecture, namely graphics processing unit (GPU), with the goal of processing large-scal...
متن کاملBatched QR and SVD Algorithms on GPUs with Applications in Hierarchical Matrix Compression
We present high performance implementations of the QR and the singular value decomposition of a batch of small matrices hosted on the GPU with applications in the compression of hierarchical matrices. The one-sided Jacobi algorithm is used for its simplicity and inherent parallelism as a building block for the SVD of low rank blocks using randomized methods. We implement multiple kernels based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1008.1371 شماره
صفحات -
تاریخ انتشار 2010